城市排水管网风险评估研究

总结了常见的城市排水管网风险评估的方法及软件,对污水管网的气体爆炸风险、雨水管网的内涝风险、综合风险这三类风险评估的文献进行了归纳整理,并对未来的研究重点及趋势做出了预测。     

Using deep learning to combine static and dynamic power analyses of cryptographic circuits

Side-channel attacks have shown to be efficient tools in breaking cryptographic hardware. Many conventional algorithms have been proposed to perform side-channel attacks exploiting the dynamic power leakage. In recent years, with the development of processing technology, static power has emerged as a new potential source for side-channel leakage. Both types of power leakage have their advantages and disadvantages. In this work, we propose to use the deep neural network technique to combine the benefits of both static and dynamic power. This approach replaces the classifier in template attacks with our proposed long short-term memory network schemes. Hence, instead of deriving a specific probability density model for one particular type of power leakage, we gain the ability of combining different leakage sources using a structural algorithm. In this paper, we propose three schemes to combine the static and dynamic power leakage. The performance of these schemes is compared using simulated test circuits designed with a 45-nm library.     

Impact of the anode operating conditions on the liquid water distribution in the cathode gas diffusion layer

Previous experimental results indicate that the humidification conditions at the anode have an impact on the liquid water distribution in the cathode gas diffusion layer. Numerical simulations are developed to reproduce and analyze this effect. Results consistent with the experimental results are first obtained by playing with the partition coefficients of an advanced pore network model computing the liquid water formation and transfer in the cathode gas diffusion layer (GDL) for a large range of operating conditions. Then, a model for the full anode – cathode assembly is developed by combining the pore network model of the cathode GDL and a 1D model describing the heat and water transfer in the various components of the anode-cathode assembly. This enables one to generalize the dry – wet regime diagram introduced in a previous work by incorporating the effect of the humidity condition at the anode.     

基于改进LFM算法的主动解列断面搜索方法

针对传统解列断面算法复杂度高的问题,提出一种基于改进LFM算法的解列断面搜索方式。首先,基于节点间电气联系和能量转移分布熵完成电网加权复杂网络建模;其次,基于主动解列断面约束条件,对LFM算法做适应性改良;最后,通过改进LFM算法得到解列断面,并在IEEE39节点系统中验证了算法有效性。仿真结果表明,改进LFM算法可充分考虑传统解列断面的约束条件,在算法具有较低复杂度的同时对系统运行状态更强的适应性。     

电商平台产品共同购买网络的影响因素研究

共同购买网络的推荐系统应用越加广泛，仅基于网络内生结构变量研究其共同购买链接的经济意义已有局限，故加入网络口碑这一外生变量，进行更全面的分析。采用了社会网络方法中指数随机图模型进行建模，主要围绕产品销售量、产品入度、差评率和评论数4个方面因素，探究其对共同购买网络中共同购买链接形成的影响。结果显示，销售量、产品入度和评论数对共同购买链接形成的影响呈正比关系，而差评率则会显著地降低产品共同购买的几率。该指数随机图构建出的共同购买网络为在线电商平台管理网络口碑和推荐系统优化设计提供有益参考。     

Engineering grain boundary anisotropy to elucidate grain growth behavior in alumina

Current grain growth models have evolved to account for the relationship between grain boundary energy/mobility anisotropy and the five degrees of grain boundary character. However, the role of grain boundary networks on overall growth kinetics remains poorly understood. To experimentally investigate this problem, a highly textured Al₂O₃ was fabricated by colloidal casting in a strong magnetic field to engineer a unique spatial distribution of grain boundary character. Microstructural evolution was quantified and compared to an untextured sample. From this comparison, a prevalence of (0001)/(0001) terminated grain boundaries with anisotropic networks were identified in the textured sample. These boundaries and their networks were found to be driving grain growth at a faster rate than predicted by models. These findings will allow better modelling of grain growth in real systems by experimentally exploring the impact thereon of grain boundary plane anisotropy and relative energy/mobility differences between neighboring boundaries.     

基于GIS单线图的配网停电单模拟操作应用研究

配电网停电会造成电力系统供配电可靠性以及服务质量下降,研究基于地理信息系统(GIS)单线图的配网停电单模拟操作应用。利用网格长度作为基本单位建立坐标系,以选取起始点与终止点为基础,通过四参数法将GIS坐标映射至图纸网格内,实现配网内设备初步布局,将杆塔、站房和整体均匀分布作为优化目标,设置多目标优化目标函数实现GIS单线图最终优化。选取某电力公司配网作为单模拟操作应用对象,模拟结果表明,单模拟操作配网停电后,该配网各负荷点年故障率、次平均停电时间以及年停电时间均有所减少,可有效提升配网的供配电可靠性。     

基于Prophet人工智能算法的网络潮汐效应预测研究

本文使用Prophet人工智能算法研究与预测移动通信网络“潮汐效应”现象，探索网络“潮汐效应”在优化网络资源配置实现网络降本增效的作用。Prophet人工智能算法是一种简单、有效，且易于实现的人工智能算法。通过facebook的人工智能开源框架fbprophet，研究4G网络PRB利用率等网络资源指标的“潮汐效应”，并预测这些网络资源指标在未来的变化趋势，用来指导当前4G网络减容、扩容和4/5G节电节能等，实现优化网络资源配置达到降本增效的目的。     

An adjusted K‐medoids clustering algorithm for effective stability in vehicular ad hoc networks

Recently, the routing problem in vehicular ad hoc networks is one of the most vital research. Despite the variety of the proposed approaches and the development of communications technologies, the routing problem in VANET suffers from the high speed of vehicles and the repetitive failures in communications. In this paper, we adjusted the well‐known K‐medoids clustering algorithm to improve the network stability and to increase the lifetime of all established links. First, the number of clusters and the initial cluster heads will not be selected randomly as usual, but based on mathematical formula considering the environment size and the available transmission ranges. Then the assignment of nodes to clusters in both k‐medoids phases will be carried out according to several metrics including direction, relative speed, and proximity. To the best of our knowledge, our proposed model is the first that introduces the new metric named “node disconnection frequency.” This metric prevents nodes with volatile and suspicious behavior to be elected as a new CH. This screening ensures that the new CH retains its property as long as possible and thus increases the network stability. Empirical results confirm that in addition to the convergence speed that characterizes our adjusted K‐medoids clustering algorithm (AKCA), the proposed model achieves more stability and robustness when compared with most recent approaches designed for the same objective.     

基于k-shell的复杂网络最短路径近似算法

复杂网络最短路径经典算法的处理效率较低，不适用于大规模复杂网络，而现有近似算法通用性有限，且计算准确率不理想，不能满足规模日益扩大的复杂网络中的最短路径计算需求。针对于此，提出基于[k]-shell的复杂网络最短路径近似算法。算法利用节点的[k]-shell值进行网络划分并引导搜索路径，利用超点聚合处理[k]-shell子网来降低路径搜索中节点和连边的规模，通过在路径搜索过程使用双向搜索树方法提高算法的计算效率和准确率。实验结果表明，算法通用性较好，在现实与仿真大规模复杂网络中均具有较高的计算效率和准确率。